Weight enumerators of codes derived from polynomial product algorithms

Weight enumerators of self-orthogonal codes

Complete Weight Enumerators of Some Linear Codes

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we determine the explicit complete weight enumerators of two classes of linear codes over Fp and they may have applications in cryptography and secret sharing schemes. Moreover, some examples are included to illustrate our results. Index Terms Linear code, complete weight e...

Support Weight Enumerators and Coset Weight Distributions of Isodual Codes

In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete co...

A construction of linear codes and their complete weight enumerators

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let m > 2 be a positive integer. For an odd prime p, let r = p and Tr be the absolute trace function from Fr onto Fp. In this paper, we give a construction of linear codes by defining the code CD = {(Tr(ax))x∈D : a ∈ Fr}, where D = { x ∈ Fr :...

Weight Enumerators of Self - Orthogonal Codes over Gf ( 3 )

The Hamming and complete weight enumerators of maximally self-orthogonal codes over GF(3) of lengths 12m 1, 12m and 12rn + are characterized. The results for length 12rn + are believed to be new, while those for length 12m-and 12m have been considerably simplified.